New inertial algorithm for solving split common null point problem in Banach spaces
نویسندگان
چکیده
منابع مشابه
Multidirectional hybrid algorithm for the split common fixed point problem and application to the split common null point problem
In this article, a new multidirectional monotone hybrid iteration algorithm for finding a solution to the split common fixed point problem is presented for two countable families of quasi-nonexpansive mappings in Banach spaces. Strong convergence theorems are proved. The application of the result is to consider the split common null point problem of maximal monotone operators in Banach spaces. ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe split common fixed point problem for asymptotically nonexpansive semigroups in Banach spaces
*Correspondence: [email protected] 1College of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming, Yunnan 650221, P.R. China Abstract In this paper, we propose an iteration method for finding a split common fixed point of asymptotically nonexpansive semigroups in the setting of two Banach spaces, and we obtain some weak and strong convergence theorems of the itera...
متن کاملA New Iterative Method for the Split Common Fixed Point Problem in Hilbert Spaces
The split common fixed-point problem is an inverse problem that consists in finding an element in a fixed-point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we propose a new algorithm that is completely different from the existing algorithms. Under standard assumptions, we establish a weak convergence theorem of the proposed algorith...
متن کاملRegularization Inertial Proximal Point Algorithm for Convex Feasibility Problems in Banach Spaces
Abstract The purpose of this paper is to give a regularization variant of the inertial proximal point algorithm not only in an infinite-dimensional Banach space E, which is an uniformly smooth and uniformly convex, but also in its finite-dimensional approximations for finding a point in the nonempty intersection ∩i=1Ci, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2019
ISSN: 1029-242X
DOI: 10.1186/s13660-019-1971-4